English+GermanWikipedia - /page/entry.mu

Micron Document

<!DOCTYPE html>

<title>Dijkstra-Preis</title>

</head>

<h1 id="firstHeading" class="firstHeading mw-first-heading"><span class="mw-page-title-main">Dijkstra-Preis</span></h1>

</header>

</div>

<div id="mw-content-text" class="mw-body-content mw-content-ltr" lang="de" dir="ltr"><div class="mw-content-ltr mw-parser-output" lang="de" dir="ltr"><p>Der <b>Dijkstra-Preis</b> <i>(Edsger W. Dijkstra Prize in Distributed Computing)</i> ist ein <a href="Informatik" title="Informatik">Informatik</a>-Preis. Er wird für herausragende Arbeiten in <a href="Verteiltes_Rechnen" class="mw-redirect" title="Verteiltes Rechnen">Verteiltem Rechnen</a> (Distributed Computing) vergeben. Er ist seit 2003 nach dessen Tod (2002) zu Ehren von <a href="Edsger_W._Dijkstra" title="Edsger W. Dijkstra">Edsger W. Dijkstra</a> benannt und hieß vorher <i>PODC Influential Paper Award</i>, verliehen vom <i><a href="Association_for_Computing_Machinery" title="Association for Computing Machinery">ACM</a> Symposium on Principles of Distributed Computing</i> (PODC). Seit 2007 wird er auch zusammen mit der <a href="European_Association_for_Theoretical_Computer_Science" title="European Association for Theoretical Computer Science">European Association for Theoretical Computer Science</a> (EATCS) verliehen vom <i>International Symposium on Distributed Computing</i> (DISC). Er ist mit 2000 Dollar dotiert und wird jährlich alternierend auf den Treffen der PODC oder der DISC verliehen.

</p>

<div class="mw-heading mw-heading2"><h2 id="Preisträger"><span id="Preistr.C3.A4ger"></span>Preisträger</h2></div>

<ul><li>2000 <a href="Leslie_Lamport" title="Leslie Lamport">Leslie Lamport</a> für <i>Time, clocks and the ordering of events in distributed systems</i>, Communications of the ACM, Band 21, 1978, S. 558</li>

<li>2001 Michael J. Fischer, <a href="Nancy_Lynch" title="Nancy Lynch">Nancy A. Lynch</a>, <a href="Michael_S._Paterson" class="mw-redirect" title="Michael S. Paterson">Michael S. Paterson</a> für <i>Impossibility of Distributed Consensus with One Faulty Process</i>, Journal of the ACM, Band 32, 1985, S. 374</li>

<li>2002 <a href="Edsger_W._Dijkstra" title="Edsger W. Dijkstra">Edsger W. Dijkstra</a> für <i>Self-stabilizing systems in spite of distributed control</i>, Communications of the ACM, Band 17, 1974, S. 643</li>

<li>2003 <a href="Maurice_Herlihy" title="Maurice Herlihy">Maurice Herlihy</a> für <i>Wait-Free Synchronization</i>, ACM Transactions on Programming Languages and Systems, Band 13, 1991, S. 124–149</li>

<li>2004 <a href="Robert_G._Gallager" class="mw-redirect" title="Robert G. Gallager">Robert G. Gallager</a>, Pierre A. Humblet, Philip M. Spira für <i>A Distributed Algorithm for Minimum-Weight Spanning Trees</i>, ACM Transactions on Programming Languages and Systems, Band 5, 1983, S. 66–77</li>

<li>2005 Marshall Pease, Robert Shostak, <a href="Leslie_Lamport" title="Leslie Lamport">Leslie Lamport</a> für <i>Reaching agreement in the presence of faults</i>, Journal of the ACM, Band 27, 1980, S. 228 (Byzantine Agreement Problem)</li>

<li>2006 John M. Mellor-Crummey, Michael L. Scott für <i>Algorithms for scalable synchronization on shared-memory multiprocessors</i>, ACM Transactions on Computer Systems, Band 9, 1991, S. 21</li>

<li>2007 <a href="Cynthia_Dwork" title="Cynthia Dwork">Cynthia Dwork</a>, <a href="Nancy_Lynch" title="Nancy Lynch">Nancy A. Lynch</a>, Larry Stockmeyer für <i>Consensus in the presence of partial synchrony</i>, Journal of the ACM, Band 35, 1988, S. 288–323</li>

<li>2008 Baruch Awerbuch, David Peleg für <i>Sparse partitions</i>, Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS), 1990, S. 503</li>

<li>2009 <a href="Joseph_Halpern" title="Joseph Halpern">Joseph Halpern</a>, <a href="Yoram_Moses" title="Yoram Moses">Yoram Moses</a> für <i>Knowledge and Common Knowledge in a Distributed Environment</i>, Journal of the ACM, Band 37, 1990, S. 549</li>

<li>2010 Tushar D. Chandra, Vassos Hadzilacos, Sam Toueg für <i>Unreliable Failure Detectors for Reliable Distributed Systems</i>, Journal of the ACM, Band 43, 1996, S. 225–267, <i>The Weakest Failure Detector for Solving Consensus</i>, ibid, S. 685–722</li>

<li>2011 Hagit Attiya, Amotz Bar-Noy und Danny Dolev für <i>Sharing Memory Robustly in Message-Passing Systems</i>, Journal of the ACM, Band 42, 1995, S. 124–142</li>

<li>2012 <a href="Maurice_Herlihy" title="Maurice Herlihy">Maurice Herlihy</a>, Eliot Moss, <a href="Nir_Shavit" title="Nir Shavit">Nir Shavit</a>, Dan Touitou für Herlihy, Moss <i>Transactional Memory: Architectural Support for Lock-Free Data Structures</i>, Proceedings of the 20th Annual International Symposium on Computer Architecture, 1993, S. 289–300, und Shavit, Touitou <i>Software Transactional Memory</i>, Distributed Computing, Band 10, 1997, S. 99–116, Februar 1997 (und Proc. 14th Annual ACM Symp. on Principles of Distributed Computing, August 1995, S. 204–213).</li>

<li>2013 <a href="Nati_Linial" title="Nati Linial">Nati Linial</a> für <i>Locality in Distributed Graph Algorithms.</i> SIAM Journal on Computing, Band 21, 1992, S. 193–201</li>

<li>2014 Kanianthra Mani Chandy und <a href="Leslie_Lamport" title="Leslie Lamport">Leslie Lamport</a> für <i>Distributed Snapshots: Determining Global States of Distributed Systems.</i> ACM Transactions on Computer Systems, Band 3, 1985, S. 63–75</li>

<li>2015

<ul><li>Michael Ben-Or für <i>Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols.</i> Proceedings of the Second ACM Symposium on Principles of Distributed Computing, S. 27–30, August 1983</li>

<li><a href="Michael_O._Rabin" title="Michael O. Rabin">Michael O. Rabin</a> für <i>Randomized Byzantine Generals.</i> Proceedings of Twenty-Fourth IEEE Annual Symposium on Foundations of Computer Science, S. 403–409, November 1983</li></ul></li>

<li>2016

<ul><li><a href="Noga_Alon" title="Noga Alon">Noga Alon</a>, <a href="L%C3%A1szl%C3%B3_Babai" title="László Babai">László Babai</a>, Alon Itai für <i>A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem.</i> Journal of Algorithms, 7(4):567-583, 1986</li>

<li><a href="Michael_Luby" title="Michael Luby">Michael Luby</a> für <i>Simple Parallel Algorithm for the Maximal Independent Set Problem.</i> Proceedings of the 17th Annual ACM Symposium on Theory of Computing (STOC), S. 1–10, May 1985, und SIAM Journal on Computing, 15(4):1036-1053, 1986</li></ul></li>

<li>2017 Elizabeth Borowsky, Eli Gafni für <i>Generalized FLP impossibility result for t-resilient asynchronous computations.</i> Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC 93), S. 91–100, Mai 1993</li>

<li>2018 Bowen Alpern, Fred B. Schneider für <i>Defining liveness</i>. Information Processing Letters 21(4), Oktober 1985, S. 181–185</li>

<li>2019 Alessandro Panconesi, Aravind Srinivasan für <i>Randomized Distributed Edge Coloring via an Extension of the Chernoff–Hoeffding Bounds</i>. SIAM Journal on Computing, 26 (2), 1997, S. 350–36</li>

<li>2020 Dana Angluin, James Aspnes, Zoe Diamadi, Michael J. Fischer, Rene Peralta für <i>Computation in networks of passively mobile finite-state sensors.</i> Distributed Computing, 18(4), 2006, S. 235–253</li>

<li>2021 Paris C. Kanellakis, Scott A. Smolka für <i>CCS Expressions, Finite State Processes, and Three Problems of Equivalence</i>. Information and Computation, 86(1), 1990, S. 43–68</li>

<li>2022

<ul><li>Maged M. Michael für <i>Safe Memory Reclamation for Dynamic Lock-Free Objects Using Atomic Reads and Writes</i>. Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), 2002, S. 21–30.</li>

<li><a href="Maurice_Herlihy" title="Maurice Herlihy">Maurice Herlihy</a>, Victor Luchangco, Mark Moir für <i>The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures.</i> Proceedings of the 16th International Symposium on Distributed Computing (DISC), 2002, S. 339–353.</li></ul></li>

<li>2023

<ul><li>Michael Ben-Or, <a href="Shafi_Goldwasser" class="mw-redirect" title="Shafi Goldwasser">Shafi Goldwasser</a>, <a href="Avi_Wigderson" title="Avi Wigderson">Avi Wigderson</a> für <i>Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation</i>. Proceedings of the 20th ACM Symposium on Theory of Computing (STOC), 1988, S. 1–10.</li>

<li><a href="David_Chaum" title="David Chaum">David Chaum</a>, <a href="Claude_Cr%C3%A9peau" title="Claude Crépeau">Claude Crépeau</a>, Ivan Damgård für <i>Multiparty unconditionally secure protocols.</i> Proceedings of the twentieth annual ACM symposium on Theory of computing, 1988, S. 11–19.</li>

<li><a href="Tal_Rabin" title="Tal Rabin">Tal Rabin</a>, Michael Ben-Or für <i>Verifiable Secret Sharing and Multiparty Protocols with Honest Majority</i>. Proceedings of the 21st ACM Symposium on Theory of Computing (STOC), 1989, S. 73–85.</li></ul></li>

<li>2024 Nicola Santoro, Peter Widmayer für <i>Time is Not a Healer.</i> Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science, 1989, S. 304–313.</li>

<li>2025 <a href="Moni_Naor" title="Moni Naor">Moni Naor</a>, Larry Stockmeyer für <i>What Can Be Computed Locally?</i> SIAM Journal on Computing, 1995, S. 1259–1277<sup id="cite_ref-1" class="reference"><a href="#cite_note-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup></li></ul>

<div class="mw-heading mw-heading2"><h2 id="Weblinks">Weblinks</h2></div>

<ul><li><a rel="nofollow" class="external text" href="http://www.podc.org/dijkstra/">Offizielle Webseite bei der PODC</a></li>

<li><a rel="nofollow" class="external text" href="http://www.eatcs.org/index.php/dijkstra-prize">Webseite bei der EATCS</a></li>

<li><a rel="nofollow" class="external text" href="http://www.disc-conference.org/wp/dijkstra-prize/">Webseite bei der DISC</a></li></ul>

<li id="cite_note-1"><span class="mw-cite-backlink"><a href="#cite_ref-1">↑</a></span> <span class="reference-text"><span class="cite"><a rel="nofollow" class="external text" href="https://mathstodon.xyz/@podc_disc/114602422348072507"><i>2025 Edsger W. Dijkstra Prize in Distributed Computing will be awarded to Moni Naor and Larry Stockmeyer (1948–2004).</i></a> PODC-DISC (@podc_disc@mathstodon.xyz), 31. Mai 2025,<span class="Abrufdatum"> abgerufen am 6. Juni 2025</span>.</span><span style="display: none;" class="Z3988" title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rfr_id=info%3Asid%2Fde.wikipedia.org%3ADijkstra-Preis&rft.title=2025+Edsger+W.+Dijkstra+Prize+in+Distributed+Computing+will+be+awarded+to+Moni+Naor+and+Larry+Stockmeyer+%281948%E2%80%932004%29&rft.description=2025+Edsger+W.+Dijkstra+Prize+in+Distributed+Computing+will+be+awarded+to+Moni+Naor+and+Larry+Stockmeyer+%281948%E2%80%932004%29&rft.identifier=https%3A%2F%2Fmathstodon.xyz%2F%40podc_disc%2F114602422348072507&rft.publisher=PODC-DISC+%28%40podc_disc%40mathstodon.xyz%29&rft.date=2025-05-31&rft.language=de"> </span></span>

</li>

</ol></div><div><div class="zim-footer">

Dieser Artikel wurde von <a class="external text" title="Zuletzt bearbeitet am 2026-01-05" href="https://de.wikipedia.org/wiki/?title=Dijkstra-Preis&oldid=263067999">Wikipedia</a> herausgegeben. Der Text ist unter <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.de">Creative Commons Attribution-Share Alike 4.0</a> verfügbar, sofern nicht anders angegeben. Für die Mediendateien können zusätzliche Bedingungen gelten.

</div>

</div></div>

</div>

</main>

</div>

</body></html>